Numerical Solutions of Monic Chebyshev Polynomials on Large Scale Differentiation
نویسندگان
چکیده
In this paper, a new formula of the spectral differentiation matrices is presented. Therefore, the numerical solutions for higher-order differential equations are presented by expanding the unknown solution in terms of monic Chebyshev polynomials. The resulting systems of linear equations are solved directly for the values of the solution at the extreme points of the Chebyshev polynomial of order N. The round-off errors during the calculations of differentiation matrices elements are studied. A number of numerical examples are provided in order to show the advantages of the suggested differentiation matrices through comparisons with other works.
منابع مشابه
A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملThe Chebyshev Polynomials of a Matrix
A Chebyshev polynomial of a square matrix A is a monic polynomial p of specified degree that minimizes ‖p(A)‖2. The study of such polynomials is motivated by the analysis of Krylov subspace iterations in numerical linear algebra. An algorithm is presented for computing these polynomials based on reduction to a semidefinite program which is then solved by a primaldual interior point method. Exam...
متن کاملMonic Chebyshev Approximations for Solving Optimal Control Problem with Volterra Integro Differential Equations
In this paper, we formulate and analyze a new model for solving optimal control problems governed by Volterra integro-differential equations. The control and state variables are approximated by using monic Chebyshev series. The optimal control problem is reduced to a constrained optimization problem. Numerical examples are solved to show good ability and accuracy of the present approach.
متن کاملOn Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...
متن کاملThe operational matrix of fractional derivative of the fractional-order Chebyshev functions and its applications
In this paper, we introduce a family of fractional-order Chebyshev functions based on the classical Chebyshev polynomials. We calculate and derive the operational matrix of derivative of fractional order $gamma$ in the Caputo sense using the fractional-order Chebyshev functions. This matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...
متن کامل